Normally admissible stratifications and calculation of normal cones to a finite union of polyhedral sets

نویسندگان

  • Lukáš Adam
  • Miroslav Pǐstěk
چکیده

This paper considers computation of Fréchet and limiting normal cones to a finite union of polyhedra. To this aim, we introduce a new concept of normally admissible stratification which is convenient for calculations of such cones and provide its basic properties. We further derive formulas for the above mentioned cones and compare our approach to those already known in the literature. Finally, we apply this approach to a class of time dependent problems and provide an illustration on a special structure arising in delamination modeling.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Intersection Properties of Polyhedral Norms

We investigate the familyM of intersections of balls in a finite dimensional vector space with a polyhedral norm. The spaces for whichM is closed under Minkowski addition are completely determined. We characterize also the polyhedral norms for which M is closed under adding a ball. A subset P ofM consists of the Mazur sets K, defined by the property that for any hyperplane H not meeting K there...

متن کامل

Admissibility of Linear Predictors of Finite Population Parameters under Reflected Normal Loss Function

One of the most important prediction problems in finite population is the prediction of a linear function of characteristic values of a finite population. In this paper the admissibility of linear predictors of an arbitrary linear function of characteristic values in a finite population under reflected normal loss function is considered. Under the super-population model, we obtain the condition...

متن کامل

Remark on Polyhedral Cones a Remark on Polyhedral Cones from Packed Words and from Finite Topologies Darij Grinberg

Definition 0.2. For any two sets X and Y, let Map (X, Y) denote the set of all maps from X to Y. Define a K-vector space M by M = ⊕ n≥0 Map (Rn, K) (where each Map (Rn, K) becomes a K-vector space by pointwise addition and multiplication with scalars). We make M into a K-algebra, whose multiplication is defined as follows: For any n ∈ N, any m ∈ N, any f ∈ Map (Rn, K) and g ∈ Map (Rm, K), we de...

متن کامل

Estimating a Bounded Normal Mean Relative to Squared Error Loss Function

Let be a random sample from a normal distribution with unknown mean and known variance The usual estimator of the mean, i.e., sample mean is the maximum likelihood estimator which under squared error loss function is minimax and admissible estimator. In many practical situations, is known in advance to lie in an interval, say for some In this case, the maximum likelihood estimator...

متن کامل

Robust portfolio selection with polyhedral ambiguous inputs

 Ambiguity in the inputs of the models is typical especially in portfolio selection problem where the true distribution of random variables is usually unknown. Here we use robust optimization approach to address the ambiguity in conditional-value-at-risk minimization model. We obtain explicit models of the robust conditional-value-at-risk minimization for polyhedral and correlated polyhedral am...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015